A graph-theoretic approach to protect static and moving targets from adversaries

نویسندگان

  • John P. Dickerson
  • Gerardo I. Simari
  • V. S. Subrahmanian
  • Sarit Kraus
چکیده

The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack those assets. The dynamic asset protection (DAP) problem is a version of SAP where the asset is following a fixed and widely known route (e.g., a parade route) and needs to be protected. We formalize what it means for a given allocation of resources to be “optimal” for protecting a desired set of assets, and show that randomly allocating resources to a single edge cut in the road network solves this problem. Unlike SAP, we show that DAP is not only an NP-complete problem, but that approximating DAP is also NP-hard. We provide the GreedyDAP heuristic algorithm to solve DAP and show experimentally that it works well in practice, using road network data for real cities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A module theoretic approach to‎ ‎zero-divisor graph with respect to (first) dual

Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...

متن کامل

A Robust Solution Concept for Human Bounded Rationality in Security Games

Game-theoretic approaches have been proposed for addressing the complex problem of assigning limited security resources to protect a critical set of targets. However, many of the standard assumptions fail to address human adversaries who security forces will likely face. To address this challenge, previous research has attempted to integrate models of human decision-making into the game-theoret...

متن کامل

Centralized Path Planning for Multi-aircraft in the Presence of Static and Moving Obstacles

This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies ...

متن کامل

A Robust Approach to Addressing Human Adversaries in Security Games

Game-theoretic approaches have been proposed for addressing the complex problem of assigning limited security resources to protect a critical set of targets. However, many of the standard assumptions fail to address human adversaries who security forces will likely face. To address this challenge, previous research has attempted to integrate models of human decision-making into the game-theoret...

متن کامل

PUF-Based Software Protection for Low-End Embedded Devices

In recent years, low-end embedded devices have been used increasingly in various scenarios, ranging from consumer electronics to industrial equipment. However, this evolution made embedded devices profitable targets for software piracy and software manipulation. Aggravating this situation, low-end embedded devices typically lack secure hardware to effectively protect against such attacks. In th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010